Generalized Quantifiers for Simple Properties
نویسنده
چکیده
We consider extensions of xed-point logic by means of generalized quantiiers in the context of descriptive complexity. By the well-known theorem of Immerman and Vardi, xed-point logic captures PTime over linearly ordered structures. It fails, however , to express even most fundamental structural properties, like simple cardinality properties, in the absence of order. In the present investigation we concentrate on extensions by generalized quantiiers which serve to adjoin simple or basic structural properties. An abstract notion of simplicity is put forward which isolates those structural properties, that can be characterized in terms of a concise structural invariant. The key examples are provided by all monadic and cardinality properties in a very general sense. The main theorem establishes that no extension by any family of such simple quantiiers can cover all of PTime. These limitations are proved on the basis of the semantically motivated notion of simplicity; in particular there is no implicit bound on the arities of the generalized quantiiers involved. Quite to the contrary , the natural applications concern innnite families of quantiiers adjoining certain structural properties across all arities in a uniform way.
منابع مشابه
Monadic L-fuzzy Quantifiers of the Type <1n,1>
The aim of this paper is to introduce monadic L-fuzzy quantifiers of the type 〈1, 1〉 and to investigate some of their semantic properties that are well-known in the generalized quantifier theory. Further, some relations between the semantic properties of generalized quantifiers are also studied for monadic L-fuzzy quantifiers. Finally, a property “to be extensional w.r.t. a given L-permutation ...
متن کاملComputational semantics for monadic quantifiers
The paper gives a survey of known results related to computational devices (finite and push–down automata) recognizing monadic generalized quantifiers in finite models. Some of these results are simple reinterpretations of descriptive—feasible correspondence theorems from finite–model theory. Additionally a new result characterizing monadic quantifiers recognized by push down automata is proven...
متن کاملFuzzy Sets and Systems
This paper is a continuation of the first part of our study on type 〈1, 1〉 fuzzy quantifiers determined by fuzzy measures, in which the basic notions and examples were introduced. Here, we study the properties of permutation invariance and isomorphism invariance of fuzzy quantifiers determined by pairs of functionals (S, φ) and their special cases, e.g., fuzzy quantifiers defined by fuzzy measu...
متن کاملGeneralized Quantifiers
We review recent work in the field of generalized quantifiers on finite models. We give an idea of the methods that are available in this area. Main emphasis is on definability issues, such as whether there is a logic for the PTIME properties of unordered finite models.
متن کاملBasic Properties of L-fuzzy Quantifiers of the Type <1> Determined by Fuzzy Measures
The aim of this paper is to study monadic L-fuzzy quantifiers of the type 〈1〉 determined by fuzzy measures. These fuzzy quantifiers are defined using a novel notion of ⊗-fuzzy integral. Several semantic properties of these L-fuzzy quantifiers are studied. Keywords— fuzzy integral, fuzzy logic, fuzzy measure, fuzzy quantifier, generalized quantifier
متن کامل